Géraud Sénizergues (born 9 March 1957) is a French
computer scientist at the
University of Bordeaux
The University of Bordeaux (French: ''Université de Bordeaux'') is a Lists of universities in France, public university based in Nouvelle-Aquitaine in Southern France, southwestern France.
It has several campuses in the cities and towns of Bor ...
.
He is known for his contributions to
automata theory
Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical computer science. The word ''automata'' comes from the Greek word αὐτόματο ...
,
combinatorial group theory In mathematics, combinatorial group theory is the theory of free groups, and the concept of a presentation of a group by generators and relations. It is much used in geometric topology, the fundamental group of a simplicial complex having in a nat ...
and
abstract rewriting system
In mathematical logic and theoretical computer science, an abstract rewriting system (also (abstract) reduction system or abstract rewrite system; abbreviated ARS) is a formalism that captures the quintessential notion and properties of rewriting s ...
s.
He received his
Ph.D.
A Doctor of Philosophy (PhD, Ph.D., or DPhil; Latin: or ') is the most common degree at the highest academic level awarded following a course of study. PhDs are awarded for programs across the whole breadth of academic fields. Because it is ...
(Doctorat d'état en Informatique) from the
Université Paris Diderot (Paris 7) in 1987 under the direction of
Jean-Michel Autebert.
With
Yuri Matiyasevich
Yuri Vladimirovich Matiyasevich, (russian: Ю́рий Влади́мирович Матиясе́вич; born 2 March 1947 in Leningrad) is a Russian mathematician and computer scientist. He is best known for his negative solution of Hilbert's ...
he obtained results about the
Post correspondence problem
The Post correspondence problem is an undecidable decision problem that was introduced by Emil Post in 1946. Because it is simpler than the halting problem and the ''Entscheidungsproblem'' it is often used in proofs of undecidability.
Definiti ...
. He won the 2002
Gödel Prize
The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interes ...
"for proving that equivalence of
deterministic pushdown automata In automata theory, a deterministic pushdown automaton (DPDA or DPA) is a variation of the pushdown automaton. The class of deterministic pushdown automata accepts the deterministic context-free languages, a proper subset of context-free languages.
...
is
decidable".
In 2003 he was awarded with the
Gay-Lussac Humboldt Prize.
References
External links
Homepage*
Living people
French computer scientists
Academic staff of the University of Bordeaux
Gödel Prize laureates
1957 births
{{France-scientist-stub